Optimal Primal-Dual Methods for a Class of Saddle Point Problems
نویسندگان
چکیده
منابع مشابه
Optimal Primal-Dual Methods for a Class of Saddle Point Problems
We present a novel accelerated primal-dual (APD) method for solving a class of deterministic and stochastic saddle point problems (SPP). The basic idea of this algorithm is to incorporate a multi-step acceleration scheme into the primaldual method without smoothing the objective function. For deterministic SPP, the APD method achieves the same optimal rate of convergence as Nesterov’s smoothing...
متن کاملAdaptive Primal-dual Hybrid Gradient Methods for Saddle-point Problems
The Primal-Dual hybrid gradient (PDHG) method is a powerful optimization scheme that breaks complex problems into simple sub-steps. Unfortunately, PDHG methods require the user to choose stepsize parameters, and the speed of convergence is highly sensitive to this choice. We introduce new adaptive PDHG schemes that automatically tune the stepsize parameters for fast convergence without user inp...
متن کاملA primal-dual algorithm framework for convex saddle-point optimization
In this study, we introduce a primal-dual prediction-correction algorithm framework for convex optimization problems with known saddle-point structure. Our unified frame adds the proximal term with a positive definite weighting matrix. Moreover, different proximal parameters in the frame can derive some existing well-known algorithms and yield a class of new primal-dual schemes. We prove the co...
متن کاملAdaptive Wavelet Methods for Saddle Point Problems - Optimal Convergence Rates
In this paper an adaptive wavelet scheme for saddle point problems is developed and analysed. Under the assumption that the underlying continuous problem satisfies the inf-sup condition it is shown in the first part under which circumstances the scheme exhibits asymptotically optimal complexity. This means that within a certain range the convergence rate which relates the achieved accuracy to t...
متن کاملCommunication-Efficient Distributed Primal-Dual Algorithm for Saddle Point Problem
Primal-dual algorithms, which are proposed to solve reformulated convex-concave saddle point problems, have been proven to be effective for solving a generic class of convex optimization problems, especially when the problems are ill-conditioned. However, the saddle point problem still lacks a distributed optimization framework where primal-dual algorithms can be employed. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2014
ISSN: 1052-6234,1095-7189
DOI: 10.1137/130919362